Browsing by Subject "Concurrency control"

Now showing items 1-11 of 11

    • Conference Object  

      Adjourn state concurrency control avoiding time-out problems in atomic commit protocols 

      Obermeier, S.; Böttcher, S.; Hett, M.; Chrysanthis, Panos K.; Samaras, George S. (2008)
      The use of atomic commit protocols in mobile ad-hoc networks involves difficulties in setting up reasonable timeouts for aborting a pending distributed transaction. This paper presents the non-blocking Adjourn State, a ...
    • Article  

      Balancing networks: State of the art 

      Mavronicolas, Marios (1997)
      Balancing networks have recently been proposed by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 1991, pp. 348-358 as a new class of distributed, low-contention data structures ...
    • Article  

      Blocking reduction for distributed transaction processing within MANETs 

      Obermeier, S.; Böttcher, S.; Hett, M.; Chrysanthis, Panos K.; Samaras, George S. (2009)
      Atomic commit protocols for distributed transactions in mobile ad-hoc networks have to consider message delays and network failures. We consider ad-hoc network scenarios, in which participants hold embedded databases and ...
    • Article  

      Concurrent object-oriented programming using term graph rewriting techniques 

      Papadopoulos, George Angelos (1996)
      The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent object-oriented programming techniques exploiting the fine grain highly parallel features of TGRS in a ...
    • Conference Object  

      Contention in balancing networks resolved 

      Hadjimitsis, Leonidas; Mavronicolas, Marios (ACM, 1998)
      Counting networks have been originally presented by Aspnes et al. as a new class of distributed/coordinated data structures suitable for solving many fundamental, multi-processor coordination problems that can be expressed ...
    • Article  

      Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets 

      Hadjicostis, Christoforos N.; Verghese, G. C. (2002)
      The traditional approach to fault-tolerant computation has been via modular hardware redundancy. Although universal and simple, modular redundancy is inherently expensive and inefficient. By exploiting particular structural ...
    • Article  

      Integrating Transactions into the Data-Driven Multi-threading Model Using the TFlux Platform 

      Diavastos, Andreas; Trancoso, Pedro; Luján, M.; Watson, I. (2016)
      The introduction of multi-core processors has renewed the interest in programming models which can efficiently exploit general purpose parallelism. Data-Flow is one such model which has demonstrated significant potential ...
    • Conference Object  

      Integrating transactions into the data-driven multi-threading model using the tflux platform 

      Diavastos, Andreas; Trancoso, Pedro; Luján, M.; Watson, I. (2012)
      Multi-core processors have renewed interest in programming models which can efficiently exploit general purpose parallelism. Data-Flow is one such model which has demonstrated significant potential in the past. However, ...
    • Article  

      Locating objects in mobile computing 

      Pitoura, Evaggelia 1967-; Samaras, George S. (2001)
      In current distributed systems, the notion of mobility is emerging in many forms and applications. Mobility arises naturally in wireless computing since the location of users changes as they move. Besides mobility in ...
    • Article  

      Object-oriented term graph rewriting 

      Papadopoulos, George Angelos (1999)
      The relationship between the generalised computational model of Term Graph Rewriting Systems (TGRS) and Object-Oriented Programming (OOP) is explored and exploited by extending the TGRS model with records where access to ...
    • Article  

      Supporting increment and decrement operations in balancing networks 

      Aiello, W.; Busch, Costas; Herlihy, M.; Mavronicolas, Marios; Shavit, N.; Touitou, D. (1999)
      Counting networks are a class of distributed data structures that support highly concurrent implementations of shared Fetch&Increment counters. Applications of these counters include shared pools and stacks, load balancing, ...